Attention-Based Deep Learning Approach for Semantic Analysis of Chest X-Ray Images Modality

The world today is suffering from a huge pandemic COVID-19 that has infected 106M people around the globe causing 2.33M deaths, as of February 9, 2021. To control the disease from spreading more and to provide accurate healthcare to existing patients, detection of COVID-19 at an early stage is important. As per the World Health Organization, diagnosing pneumonia is a common way of detecting COVID-19. In many situations, a chest X-ray is used to determine the type of pneumonia. However, writing a report for every chest X-ray becomes a tedious and time-taking task for physicians. We propose a novel method of creating reports from chest X-rays images automatically via a deep learning model using image captioning with an attention mechanism employed through CNN–LSTM architecture. On comparing the model that does not use an attention mechanism with our approach, we found that accuracy was increased from 80% to 87.5%. In conclusion, we found that results generated with attention mechanism are better, and the report thus produced can be utilized by doctors and researchers worldwide to analyze new X-rays in lesser time. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

Integrating Two-Level Reinforcement Learning Process for Enhancing Task Scheduling Efficiency in a Complex Problem-Solving Environment

Task scheduling scenarios require the system designers to have complete information about the resources and their capabilities, along with the tasks and their application-specific requirements. An effective task-to-resource mapping strategy will maximize resource utilization under constraints, while minimizing the task waiting time, which will in-turn maximize the task execution efficiency. In this work, a two-level reinforcement learning algorithm for task scheduling is proposed. The algorithm utilizes a deep-intensive learning stage to generate a deployable strategy for task-to-resource mapping. This mapping is re-evaluated at specific execution breakpoints, and the strategy is re-evaluated based on the incremental learning from these breakpoints. In order to perform incremental learning, real-time parametric checking is done on the resources and the tasks;and a new strategy is devised during execution. The mean task waiting time is reduced by 20% when compared with standard algorithms like Dynamic and Integrated Resource Scheduling, Improved Differential Evolution, and Q-learning-based Improved Differential Evolution;while the resource utilization is improved by more than 15%. The algorithm is evaluated on datasets from different domains like Coronavirus disease (COVID-19) datasets of public domain, National Aeronautics and Space Administration (NASA) datasets and others. The proposed method performs consistently on all the datasets. © 2023 IETE.

An Optimized Modelling and Simulation on Task Scheduling for Multi-Processor System using Hybridized ACO-CVOA

Task allocation on the multi-processor system distributes the task according to capacity of each processor that optimally selects the best. The optimal selection of processor leads to increase performance and this also impact the makespan. In task scheduling, most of the research work focused on the objective of managing the power consumption and time complexity due to improper selection of processors for the given task items. This paper mainly focusses on the modelling of the optimal task allocation using a novel hybridization method of Ant Colony Optimization (ACO) with Corona Virus Optimization Algorithm (CVOA). There are several other methods that estimate the weight value of processors and find the best match to the task by using the traditional distance estimation method or by using standard rule-based validation. The proposed algorithm searches the best selection of machines for the corresponding parameters and weight value iteratively and finally recognizes the capacity of it. The performance of proposed method is evaluated on the parameters of elapsed time, throughput and compared with the state-of-art methods. © 2022 Institute of Information Science. All rights reserved.

Energy-Aware Bag-of-Tasks Scheduling in the Cloud Computing System Using Hybrid Oppositional Differential Evolution-Enabled Whale Optimization Algorithm

Bag-of-Tasks (BoT) scheduling over cloud computing resources called Cloud Bag-of-Tasks Scheduling (CBS) problem, which is a well-known NP-hard optimization problem. Whale Optimization Algorithm (WOA) is an effective method for CBS problems, which still requires further improvement in exploration ability, solution diversity, convergence speed, and ensuring adequate exploration–exploitation tradeoff to produce superior scheduling solutions. In order to remove WOA limitations, a hybrid oppositional differential evolution-enabled WOA (called h-DEWOA) approach is introduced to tackle CBS problems to minimize workload makespan and energy consumption. The proposed h-DEWOA incorporates chaotic maps, opposition-based learning (OBL), differential evolution (DE), and a fitness-based balancing mechanism into the standard WOA method, resulting in enhanced exploration, faster convergence, and adequate exploration–exploitation tradeoff throughout the algorithm execution. Besides this, an efficient allocation heuristic is added to the h-DEWOA method to improve resource assignment. CEA-Curie and HPC2N real cloud workloads are used for performance evaluation of scheduling algorithms using the CloudSim simulator. Two series of experiments have been conducted for performance comparison: one with WOA-based heuristics and another with non-WOA-based metaheuristics. Experimental results of the first series of experiments reveal that the h-DEWOA approach results in makespan improvement in the range of 5.79–13.38% (for CEA-Curie workloads), 5.03–13.80% (for HPC2N workloads), and energy consumption in the range of 3.21–14.70% (for CEA-Curie workloads) and 10.84–19.30% (for HPC2N workloads) over well-known WOA-based metaheuristics. Similarly, h-DEWOA also resulted in significant performance in comparison with recent state-of-the-art non-WOA-based metaheuristics in the second series of experiments. Statistical tests and box plots also revealed the robustness of the proposed h-DEWOA algorithm.